Theory propagation and reification
نویسندگان
چکیده
منابع مشابه
Theory propagation and reification
SAT Modulo Theories (SMT) is the problem of determining the satisfiability of a formula in which constraints, drawn from a given constraint theory T , are composed with logical connectives. The DPLL(T ) approach to SMT has risen to prominence as a technique for solving these quantifier-free problems. The key idea in DPLL(T ) is to couple unit propagation in the propositional part of the problem...
متن کاملA Preliminary Reification of Argument Theory Change
In this article we introduce the basics for understanding the mechanisms of Argument Theory Change. In particular we reify it using Defeasible Logic Programming. In this formalism, knowledge bases are represented through defeasible logic programs. The main change operation we define over a defeasible logic program is a special kind of revision that inserts a new argument and then modifies the r...
متن کاملWave propagation theory in offshore applications
A frequency-wavenumber-domain formulation is presented in this paper for calculation of the Green's functions and wave propagation modes in a stratified fluid body underlain by a layered viscoelastic soil medium. The Green's functions define the solid and fluid displacements and fluid pressures due to uniform disk loads acting in either the soil or fluid media. The solution is in the frequency ...
متن کاملLiteral Reification
In this paper we introduce the pattern literal reification, a modelling technique to address scenarios, in which we need to bless particular literals, usually when applying data properties, in order to use them as subjects and/or full-fledged objects of semantic assertions.
متن کاملHalf Reification and Flattening
Usually propagation-based constraint solvers construct a constraint network as a conjunction of constraints. They provide propagators for each form of constraint c. In order to increase expressiveness, systems also usually provide propagators for reified forms of constraints. A reified constraint b ↔ c associates a truth value b with a constraint c. With reified propagators, systems can express...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2015
ISSN: 0167-6423
DOI: 10.1016/j.scico.2014.05.013